An Incremental Algorithm for Computing n-concepts
نویسندگان
چکیده
In this paper a new incremental algorithm for computing nconcepts is proposed. The time complexity of the algorithm is O(|I| · In · |Bn|), where |I| is the size of a context (an n-ary relation), In = |K1||Bn−1| is the input, where K1 is a set corresponding to an added dimension and Bn−1 is the set of (n− 1)-concepts. The output Bn of the algorithm is a set of n-concepts. The algorithm creates n-concepts (i.e. elements in Bn) by merging sequentially (n−1)-concepts from Bn−1 with the corresponding elements from the n-th dimension (i.e. set K1).
منابع مشابه
An Approach to Management of Health Care and Medical Diagnosis Using of a Hybrid Disease Diagnosis System
Introduction: In order to simplify the information exchange within the medical diagnosis process, a collaborative software agent’s framework is presented. The purpose of the framework is to allow the automated information exchange between different medicine specialists. Methods: This study presented architecture of a hybrid disease diagnosis system. The architecture employed a learning...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملAn optimization technique for vendor selection with quantity discounts using Genetic Algorithm
Vendor selection decisions are complicated by the fact that various conflicting multi-objective factors must be considered in the decision making process. The problem of vendor selection becomes still more compli-cated with the inclusion of incremental discount pricing schedule. Such hard combinatorial problems when solved using meta heuristics produce near optimal solutions. This paper propose...
متن کاملDistributed and Cooperative Compressive Sensing Recovery Algorithm for Wireless Sensor Networks with Bi-directional Incremental Topology
Recently, the problem of compressive sensing (CS) has attracted lots of attention in the area of signal processing. So, much of the research in this field is being carried out in this issue. One of the applications where CS could be used is wireless sensor networks (WSNs). The structure of WSNs consists of many low power wireless sensors. This requires that any improved algorithm for this appli...
متن کامل